Temporal code versus rate code for binary Information Sources
نویسندگان
چکیده
منابع مشابه
Temporal code versus rate code for binary Information Sources
Neuroscientists formulate very different hypotheses about the nature of neural code. At one extreme, it has been argued that neurons encode information in relatively slow changes of individual spikes arriving rates (rates codes) and the irregularity in the spike trains reflects noise in the system, while in the other extreme this irregularity is the code itself (temporal codes) thus the precise...
متن کاملHigh Rate Binary Coset Code Used for Inner Code
High rate binary coset codes are investigated. The binary coset(BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trelliscoded modulation(TCM) scheme, we have found that the e ective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the hig...
متن کاملRate Versus Temporal Code? A Spatio-Temporal Coherence Model of the Cortical Basis of Streaming
Abstract A better understanding of auditory scene analysis requires uncovering the brain processes that govern the segregation of sound patterns into perceptual streams. Existing models of auditory streaming emphasize tonotopic or “spatial” separation of neural responses as the primary determinant of stream segregation. While partially true, this theory is far from complete. It overlooks the in...
متن کاملCode Placement using Temporal Profile Information
Instruction cache performance is important to instruction fetch efficiency and overall processor performance. The layout of an executable has a substantial effect on the cache miss rate and the instruction working set size during execution. This means that the performance of an executable can be improved significantly by applying a code-placement algorithm that minimizes instruction cache confl...
متن کاملHamming Code for Multiple Sources
We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. We then introduce Hamming Codes for Multiple Sources (HCMSs) as a potential solution of perfect SW coding for arbitrary number of terminals. Moreover, we study the case with three sources in detail. We pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2016
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2016.08.034